Fairness in two-party random sampling
نویسنده
چکیده
This report generalizes the results given by Cleve (1986) that bound the fairness achievable in a multyparty coin tossing protocol. By using essentially the same proof, we show similar bounds for a biased coin and then extend the result to sampling from an arbitrary distribution. We also show bounds for two-party computation of a function but do so only in the average case.
منابع مشابه
Stability, Fairness and Random Walks in the Bargaining Problem
We study the classical bargaining problem and its two canonical solutions, (Nash and Kalai-Smorodinsky), from a novel point of view: we ask for stability of the solution if both players are able distort the underlying bargaining process by reference to a third party (e.g. a court). By exploring the simplest case, where decisions of the third party are made randomly we obtain a stable solution, ...
متن کاملLegally-Enforceable Fairness in Secure Two-Party Computation
In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their private inputs. The computation should be carried out in a secure way, meaning that the properties privacy, correctness, independence of inputs, fairness and guaranteed output delivery should all be preserved. Unfortunately, in the case of no honest majori...
متن کاملComplete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
Fairness is a desirable property in secure computation; informally it means that if one party gets the output of the function, then all parties get the output. Alas, an implication of Cleve’s result (STOC 86) is that when there is no honest majority, in particular in the important case of the two-party setting, there exist functions that cannot be computed with fairness. In a surprising result,...
متن کاملSecure Two-Party Computation with Fairness - A Necessary Design Principle
Protocols for secure two-party computation enable a pair of mutually distrustful parties to carry out a joint computation of their private inputs without revealing anything but the output. One important security property that has been considered is that of fairness which guarantees that if one party learns the output then so does the other. In the case of two-party computation, fairness is not ...
متن کاملAchieving Fairness in Private Contract Negotiation
Suppose Alice and Bob are two entities (e.g. agents, organizations, etc.) that wish to negotiate a contract. A contract consists of several clauses, and each party has certain constraints on the acceptability and desirability (i.e., a private “utility” function) of each clause. If Bob were to reveal his constraints to Alice in order to find an agreement, then she would learn an unacceptable amo...
متن کامل